Unification in Intermediate Logics
نویسندگان
چکیده
This paper contains a proof–theoretic account of unification in intermediate logics. It is shown that many existing results can be extended to fragments that at least contain implication and conjunction. For such fragments, the connection between valuations and most general unifiers is clarified, and it is shown how from the closure of a formula under the Visser rules a proof of the formula under a projective unifier can be obtained. This implies that in the logics considered, for the n-unification type to be finitary it suffices that the m-th Visser rule is admissible for a sufficiently large m. At the end of the paper it is shown how these results imply several well-known results from the literature.
منابع مشابه
Rules with parameters in modal logic I
We study admissibility of inference rules and unification with parameters in transitive modal logics (extensions of K4), in particular we generalize various results on parameterfree admissibility and unification to the setting with parameters. Specifically, we give a characterization of projective formulas generalizing Ghilardi’s characterization in the parameter-free case, leading to new proof...
متن کاملUNIF 26 26 th International Workshop on Unification Proceedings July 1 , 2012 Manchester , United Kingdom
Unification modulo equational theories was originally introduced in automated deduction and term rewriting, but has recently also found applications in modal logics and description logics. In this talk, we review problems and results for unification in description logics, and relate them to equational unification and unification in modal logics. Related problems, like disunification, rigid E-un...
متن کاملUnification in modal and description logics
Unification was originally introduced in automated deduction and term rewriting, but has recently also found applications in other fields. In this article, we give a survey of the results on unification obtained in two closely related, yet different, application areas of unification: description logics and modal logics.
متن کاملMulti-modal and Temporal Logics with Universal Formula - Reduction of Admissibility to Validity and Unification
The article studies multi-modal (in particular temporal, tense, logics) possessing universal formulas. We prove (Theorems 11 and 12) that the admissibility problem for inference rules (inference rules with parameters) is decidable for all decidable multi-modal (in particular, temporal) logics possessing an universal formula and decidable w.r.t. unification (unification with parameters). These t...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 80 شماره
صفحات -
تاریخ انتشار 2015